BSP/CGM Algorithms for the Transitive Closure Problem
نویسندگان
چکیده
We present new implementations of BSP/CGM algorithms for the Transitive Closure Problem. Our strategies deal with size of the message and communication rounds, problems that cause inefficiency in the implementations of the transitive closure algorithms. The algorithms were implemented using LAM/MPI in two Beowulfs. The implementation results show the efficiency and scalability of the presented algorithms, improve the previous results and compare favorably with other parallel implementations. Besides we show that the presented algorithms can be used to solve real problems.
منابع مشابه
A Parallel Algorithm for Transitive Closure
We present a parallel algorithm for the problem of computing the transitive closure for an acyclic digraph D with n vertices and m edges. We use the BSP/CGM model of parallel computing. Our algorithm uses O(log p) rounds of communications with p processors, where p n, and each processor has O(mn p ) local memory. The local computation of each processor is equal to the product of the number of e...
متن کاملThe Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملSome results on ongoing research on parallelimplementation of graph algorithms
In high performance computing, three recognized important points are us-ability, scalability and portability. No models seemed to satisfy these three steps till recently: a few proposed models try to fullll the previous goals. Among them, the BSP-like CGM model seemed adapted to us to facilitate the way between algorithms design and real implementations. Many algorithms have been designed but f...
متن کاملEfficient BSP/CGM Algorithms for Text Retrieval
In this paper we present efficient, scalable and portable parallel algorithms written in the Coarse-Grained Multicomputer (CGM) and the Bulk Synchronous Parallel (BSP) models for the off-line clustering, the on-line retrieval and the update phases of the text retrieval problem based on the vector space model and using clustering to organize and handle a dynamic document collection. To the best ...
متن کاملAn Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem
This study focuses on the parallel resolution of the matrix chain ordering problem and the optimal convex polygon triangulation problem on the Coarse grain multicomputer model (CGM for short). There has been intensive work on the parallelization of these dynamic programming problems in PRAM, including the use of systolic arrays, but a BSP/CGM solution is necessary for ease of implementation and...
متن کامل